Area Computation of Internet Traffic Share Problem with Special Reference to Cyber Crime Environment

Abstract— Cybercrime is a fast growing area of research, it covers any illegal activity that uses a computer as its primary means of commission. More and more criminals are exploiting the speed, convenience and anonymity of the internet to commit a diverse range of criminal activities. In the same line Naldi (2002) proposed internet traffic share problem in a new look by using markov chain. This model was extended by Shukla, Thakur and Tiwari (2010) by introducing a new cyber crime state .The importance of this state is that user performs cyber crime after successful call connectivity. In this model they developed mathematical relationship between traffic share of cyber criminals and blocking probability of operators. This relationship produces a probability function which exist a definite bounded area. This bounded area contains a lot of network parameters and is required to be estimated. An attempt has been made to analyze such kind of area by using trapezoidal method usually applies in numerical analysis. It is found that this area is inversely proportional to the probability of attraction for cyber crime and other parameter. It supports to elaborate the relationship among traffic share of cyber crime and many network parameters.